Minimum-rank positive semidefinite matrix completion with chordal patterns and applications to semidefinite relaxations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Active Positive Semidefinite Matrix Completion: Algorithms, Theory and Applications

We provide proofs that were skipped in the main paper. We also provide some additional experimental results and related work concerning multi-armed bandits that was skipped in the main paper.

متن کامل

Appendix: Active Positive Semidefinite Matrix Completion: Algorithms, Theory and Applications

We provide proofs that were skipped in the main paper. We also provide some additional experimental results and related work concerning multi-armed bandits that was skipped in the main paper.

متن کامل

Polytopes of Minimum Positive Semidefinite Rank

The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k × k real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a polytope is at least the dimension of the polytope plus one, and we characterize those polytopes whose psd rank equals this lower bound.

متن کامل

Deterministic Symmetric Positive Semidefinite Matrix Completion

We consider the problem of recovering a symmetric, positive semidefinite (SPSD) matrix from a subset of its entries, possibly corrupted by noise. In contrast to previous matrix recovery work, we drop the assumption of a random sampling of entries in favor of a deterministic sampling of principal submatrices of the matrix. We develop a set of sufficient conditions for the recovery of a SPSD matr...

متن کامل

Completely Positive Semidefinite Rank

An n×n matrix X is called completely positive semidefinite (cpsd) if there exist d×d Hermitian positive semidefinite matrices {Pi}i=1 (for some d ≥ 1) such that Xij = Tr(PiPj), for all i, j ∈ {1, . . . , n}. The cpsd-rank of a cpsd matrix is the smallest d ≥ 1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate twofold. First, the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied set-valued analysis and optimization

سال: 2023

ISSN: ['2562-7775', '2562-7783']

DOI: https://doi.org/10.23952/asvao.5.2023.2.10